Multiparty testing preorders

نویسندگان

چکیده

Variants of the must testing approach have been successfully applied in service oriented computing for analysing compliance between (contracts exposed by) clients and servers or, more generally, two peers. It has however argued that multiparty scenarios call permissive notions because partners usually do not full coordination capabilities. We propose new preorders, which are obtained by restricting set potential observers. For first preorder, called uncoordinated, we allow only sets parallel observers use different parts interface a given no possibility intercommunication. second individualistic, instead rely on perceive as silent all actions interest. uncoordinated preorder is coarser than classical finer individualistic one. also provide characterisation terms decorated traces both preorders: defined must-sets Mazurkiewicz while one described classes filtered contain designated visible must-sets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiparty Testing Preorders

Variants of the must testing approach have been successfully applied in Service Oriented Computing for analysing the compliance between (contracts exposed by) clients and servers or, more generally, between two peers. It has however been argued that multiparty scenarios call for more permissive notions of compliance because partners usually do not have full coordination capabilities. We propose...

متن کامل

Compliance and Testing Preorders Differ

Contracts play an essential role in the Service Oriented Computing, for which they need to be equiped with a sub-contract relation. We compare two possible formulations, one based on compliance and the other on the testing theory of De Nicola and Hennessy. We show that if the language of contracts is sufficiently expressive then the resulting subcontract relations are incomparable. However if w...

متن کامل

Characterising Testing Preorders for Broadcasting Distributed Systems

We present a process calculus for both specifying the desired behaviour of distributed systems and for describing their actual implementation; the calculus is aimed at the internet layer of the TCP/IP reference model. This allows us to define behavioural preorders in the style of DeNicola and Hennessy, relating specifications and implementations for distributed systems at this level of abstract...

متن کامل

Compositional Testing Preorders for Probabilistic Processes

Transition systems are well-established as a semantic model for distributed systems. There are widely accepted preorders that serve as criteria for reenement of a more abstract transition system to a more concrete one. To reason about probabilistic phenomena such as failure rates, we need to extend models and methods that have proven successful for non-probabilistic systems to a probabilistic s...

متن کامل

Full-abstraction for Must Testing Preorders

The client must preorder relates tests (clients) instead of processes (servers). The existing characterisation of this preorder is unsatisfactory for it relies on the notion of usable clients which, in turn, are defined using an existential quantification over the servers that ensure client satisfaction. In this paper we characterise the set of usable clients for finite-branching LTSs, and give...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Logical Methods in Computer Science

سال: 2023

ISSN: ['1860-5974']

DOI: https://doi.org/10.46298/lmcs-19(1:1)2023